<title>饭卡</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstring&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;algorithm&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#define N 1005</span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">],</span><span class="pl-n">v</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">][</span><span class="pl-n">N</span><span class="pl-p">];</span>
<span class="pl-kt">bool</span> <span class="pl-nf">cmp</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">b</span><span class="pl-p">){</span><span class="pl-k">return</span> <span class="pl-n">a</span><span class="pl-o">&gt;</span><span class="pl-n">b</span><span class="pl-p">;}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;card.in&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;r&quot;</span><span class="pl-p">,</span><span class="pl-n">stdin</span><span class="pl-p">);</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;card.out&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;w&quot;</span><span class="pl-p">,</span><span class="pl-n">stdout</span><span class="pl-p">);</span>
	<span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-p">,</span><span class="pl-n">j</span><span class="pl-p">,</span><span class="pl-n">n</span><span class="pl-p">,</span><span class="pl-n">m</span><span class="pl-p">;</span>
	<span class="pl-k">while</span><span class="pl-p">(</span><span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">)</span><span class="pl-o">!=</span><span class="pl-n">EOF</span><span class="pl-p">){</span>
		<span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">n</span><span class="pl-o">==</span><span class="pl-mi">0</span><span class="pl-p">)</span> <span class="pl-k">break</span><span class="pl-p">;</span>
		<span class="pl-kt">int</span> <span class="pl-n">maxx</span><span class="pl-o">=-</span><span class="pl-mi">1</span><span class="pl-p">;</span>
		<span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">dp</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">,</span><span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">dp</span><span class="pl-p">));</span>
		<span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">w</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">,</span><span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">w</span><span class="pl-p">));</span>
		<span class="pl-n">memset</span><span class="pl-p">(</span><span class="pl-n">v</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">,</span><span class="pl-k">sizeof</span><span class="pl-p">(</span><span class="pl-n">v</span><span class="pl-p">));</span>
		<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
		<span class="pl-n">sort</span><span class="pl-p">(</span><span class="pl-n">w</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">w</span><span class="pl-o">+</span><span class="pl-n">n</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">cmp</span><span class="pl-p">);</span>
		<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">v</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span>
		<span class="pl-n">maxx</span><span class="pl-o">=</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-mi">1</span><span class="pl-p">];</span>
		<span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">);</span>
		<span class="pl-kt">int</span> <span class="pl-n">maxv</span><span class="pl-o">=</span><span class="pl-n">m</span><span class="pl-o">-</span><span class="pl-mi">5</span><span class="pl-p">;</span>
		<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">maxv</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-mi">0</span><span class="pl-p">][</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
		<span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">maxv</span><span class="pl-o">&lt;</span><span class="pl-mi">0</span><span class="pl-p">){</span>
			<span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span><span class="pl-n">m</span><span class="pl-p">);</span>
			<span class="pl-k">continue</span><span class="pl-p">;</span>
		<span class="pl-p">}</span>
		<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">2</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
			<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-n">maxv</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&gt;=</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span><span class="pl-n">j</span><span class="pl-o">--</span><span class="pl-p">)</span>
				<span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">],</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-o">-</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]]</span><span class="pl-o">+</span><span class="pl-n">v</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
			<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-n">w</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&gt;=</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">--</span><span class="pl-p">)</span>
				<span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">];</span>
		<span class="pl-p">}</span>
		<span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span><span class="pl-n">m</span><span class="pl-o">-</span><span class="pl-n">dp</span><span class="pl-p">[</span><span class="pl-n">n</span><span class="pl-p">][</span><span class="pl-n">maxv</span><span class="pl-p">]</span><span class="pl-o">-</span><span class="pl-n">maxx</span><span class="pl-p">);</span>
	<span class="pl-p">}</span>
<span class="pl-p">}</span>
</cpde></pre></div>